Partially defined computer instructions and guards
نویسندگان
چکیده
منابع مشابه
Mining Determining Sets for Partially Defined Functions
This paper describes an algorithm that determines the minimal sets of variables that determine the values of a discrete partial function. The Apriori-like algorithm is based on the dual hereditary property of determining sets. Experimental results are provided that demonstrate the efficiency of the algorithm for functions with up to 24 variables. The dependency of the number of minimal determin...
متن کاملComputer Assisted Laboratory Instructions: Learning Outcomes Analysis
This paper presents results of a case study undertaken to understand the effect of computer assisted teaching methodology on learning effectiveness in a laboratory environment. The effects of computer assisted instructions on different levels of cognition of individual learners, as described by Bloom’s Taxonomy have been evaluated. For this students in mechanical engineering subject area were e...
متن کاملInducing Partially-Defined Instances with Evolutionary Algorithms
This paper addresses the issue of reducing the storage requirements on Instance-Based Learning algorithms. Algorithms proposed by other researches use heuristics to prune instances of the training set or modify the instances themselves to achieve a reduced set of instances. Our work presents an alternative way. We propose to induce a reduced set of partially-defined instances with Evolutionary ...
متن کاملThe SCMPDS Computer and the Basic Semantics of its Instructions
The article defines the SCMPDS computer and its instructions. The SCMPDS computer consists of such instructions as conventional arithmetic, ”goto”, ”return” and ”save instruction-counter” (”saveIC” for short). The address used in the ”goto” instruction is an offset value rather than a pointer in the standard sense. Thus, we don’t define halting instruction directly but define it by ”goto 0” ins...
متن کاملLinear and symmetric allocation methods for partially defined cooperative games
A partially defined cooperative game is a coalition function form game in which some of the coalitional worths are not known. An application would be cost allocation of a joint project among so many players that the determination of all coalitional worths is prohibitive. This paper generalizes the concept of the Shapley value for cooperative games to the class of partially defined cooperative g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2008
ISSN: 0167-6423
DOI: 10.1016/j.scico.2008.06.001